A note on k-cop, l-robber games on graphs
نویسندگان
چکیده
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are also possible in many situations where the movements of the cops and/or the robbers are somehow restricted. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Cop and robber games when the robber can hide and ride
In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G = (V,E). The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the ...
متن کاملCops and Robbers on Graphs (A Supplement for Intro to Graph Theory)
The game of cops and robbers on graphs is a combinatorial game introduced independently by Quilliot [20, 21, 22] and by Nowakowski and Winkler [17]. This is an example of a graph searching game (see [2, 7, 10, 18, 19] for a more on such games). Our treatment of the game of cops and robbers will be similar to the survey articles by Aigner and Fromme [1] and Hahn [11] as well as the book by Bonat...
متن کاملCop and robber game and hyperbolicity
In this note, we prove that all cop-win graphs G in the game in which the robber and the cop move at different speeds s and s′ with s′ < s, are δ-hyperbolic with δ = O(s). We also show that the dependency between δ and s is linear if s − s′ = Ω(s) and G obeys a slightly stronger condition. This solves an open question from the paper J. Chalopin et al., Cop and robber games when the robber can h...
متن کاملThe role of quantum correlations in Cop and Robber game
We introduce and study quantized versions of Cop and Robber game. We achieve this by using graph-preserving quantum operations, which are the quantum analogues of stochastic operations preserving the graph. We provide the tight bound for the number of operations required to reach the given state. By extending them to the controlled operations, we define a quantum-controlled Cop and Robber game,...
متن کاملA Little Note on the Cops & Robber Game on Graphs Embedded in Non-orientable Surfaces
The two-player, complete information game of Cops and Robber is played on undirected finite graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if, after a move, a cop and the robber are on the same vertex. The minimum number of cops needed to catch the robber on a graph is called the cop number of that graph. Let c(g) be the su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006